On Checking Timed Automata for Linear Duration Invariants
نویسندگان
چکیده
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the linear programming-based approaches in [8] to this algebraic notations for the timed automata. Our results in this paper are more general than the ones presented in [8]. Namely, Timed Automata are our starting point, and we can provide an accurate answer to the problem for a larger class of them.
منابع مشابه
Checking Linear Duration Invariants by Linear Programming
In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...
متن کاملVerifying Linear Duration Constraints of Timed Automata
This report aims at developing a technique for checking if a timed automaton satisfies a linear duration constraint on the automaton states. The constraints are represented in the form of linear duration invariants a simple class of Chop-free Duration Calculus (DC) formulas. We prove that linear duration invariants of timed automata are discretisable, and reduce checking if a timed automaton sa...
متن کاملDeciding an Interval Logic with Accumulated Durations
A decidability result and a model-checking procedure for a rich subset of Duration Calculus (DC) [19] is obtained through reductions to first-order logic over the real-closed field and to Multi-Priced Timed Automata (MPTA) [13]. In contrast to other reductions of fragments of DC to reachability problems in timed automata, the reductions do also cover constraints on positive linear combinations ...
متن کاملModel Checking Linear Duration Invariants of Networks of Automata
Linear duration invariants (LDIs) are important safety properties of real-time systems. In this paper, we reduce the problem of verification of a network of timed automata against an LDI to an equivalent problem of model checking whether a failure state is never reached. Our approach is first to transform each component automaton Ai of the network A to an automaton Gi. The transformation helps ...
متن کاملChecking Timed Automata for Some Discretisable Duration Properties
In this paper we propose a technique for checking a timed automaton w.r.t a class of discretisable duration properties. It is shown in the paper that if only integral constants are allowed in the time constraints of the timed automata, a linear duration property or an interstate duration property is satissed by a timed automaton if and only if it is satissed by all of the integral behaviours of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998